Handling control-plane connectivity loss in virtualized computing environments

ABSTRACT

Example methods are provided for a first host to handle control-plane connectivity loss in a virtualized computing environment that includes the first host, multiple second hosts and a network management entity. The method may comprise: detecting a loss of control-plane connectivity between the first host and the network management entity; and generating a request message for control information that the first host is unable to obtain from the network management entity. The method may also comprise sending the request message via a peer-to-peer network that connects the first host with the multiple second hosts; and obtaining the control information from a response message that is sent by at least one of the multiple second hosts.

BACKGROUND

Unless otherwise indicated herein, the approaches described in thissection are not admitted to be prior art by inclusion in this section.

Virtualization allows the abstraction and pooling of hardware resourcesto support virtual machines in a virtualized computing environment, suchas a Software-Defined Data Center (SDDC). For example, through servervirtualization, virtual machines running different operating systems maybe supported by the same physical machine (e.g., referred to as a“host”). Each virtual machine is generally provisioned with virtualresources to run an operating system and applications. The virtualresources may include central processing unit (CPU) resources, memoryresources, storage resources, network resources, etc.

Further, through network virtualization, benefits similar to servervirtualization may be derived for networking services in the SDDC. Forexample, multiple logical networks with different rules and policies maybe supported by the same physical network. In this case, controlinformation relating to logical networks and overlay transport tunnelsmay be collected and disseminated using a network management entity,such as a Software-Defined Network (SDN) controller. In practice,however, a host may lose control-plane connectivity with the networkmanagement entity, in which case the host will not be able to obtain thelatest control information.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic diagram illustrating an example virtualizedcomputing environment in which control-plane connectivity loss may behandled;

FIG. 2 is a flowchart of an example process for a first host to handlecontrol-plane connectivity loss in a virtualized computing environment;

FIG. 3 is a flowchart of an example process for joining a peer-to-peer(P2P) network;

FIG. 4 is a schematic diagram illustrating a first host joining a P2Pnetwork;

FIG. 5 is a flowchart of example detailed process for handlingcontrol-plane connectivity loss in virtualized computing environment;

FIG. 6 is a schematic diagram illustrating an example lookup-basedapproach for handling control-plane connectivity loss according to theexample in FIG. 5;

FIG. 7 is a schematic diagram illustrating an example flooding-basedapproach for handling control-plane connectivity loss according to theexample in FIG. 5; and

FIG. 8 is a schematic diagram illustrating an example of a first hostpushing control information to second hosts via a P2P network.

DETAILED DESCRIPTION

In the following detailed description, reference is made to theaccompanying drawings, which form a part hereof. In the drawings,similar symbols typically identify similar components, unless contextdictates otherwise. The illustrative embodiments described in thedetailed description, drawings, and claims are not meant to be limiting.Other embodiments may be utilized, and other changes may be made,without departing from the spirit or scope of the subject matterpresented here. It will be readily understood that the aspects of thepresent disclosure, as generally described herein, and illustrated inthe drawings, can be arranged, substituted, combined, and designed in awide variety of different configurations, all of which are explicitlycontemplated herein.

Challenges relating to control-plane connectivity will now be explainedin more detail using FIG. 1, which is a schematic diagram illustratingexample virtualized computing environment 100 in which control-planeconnectivity loss may be handled. It should be understood that,depending on the desired implementation, virtualized computingenvironment 100 may include additional and/or alternative componentsthan that shown in FIG. 1.

In the example in FIG. 1, virtualized computing environment 100 includesmultiple hosts, such as host-A 110A, host-B 110B and host-C 110C. Eachhost 110A/110B/110C includes suitable hardware 112A/112B/112C andvirtualization software (e.g., hypervisor-A 114A, hypervisor-B 114B,hypervisor-C 114C) to support various virtual machines. For example,host-A 110A supports VM1 131 and VM2 132; host-B 110B supports VM3 133and VM4 134; and host-C 110C supports VM5 135 and VM6 136. In practice,virtualized computing environment 100 may include any number of hosts(also known as a “computing devices”, “host computers”, “host devices”,“physical servers”, “server systems”, etc.), where each host may besupporting tens or hundreds of virtual machines.

Although examples of the present disclosure refer to virtual machines131-136, it should be understood that a “virtual machine” running onhost 110A/110B/110C is merely one example of a “virtualized computinginstance” or “workload.” A virtualized computing instance may representan addressable data compute node or isolated user space instance. Inpractice, any suitable technology may be used to provide isolated userspace instances, not just hardware virtualization. Other virtualizedcomputing instances may include containers (e.g., running on top of ahost operating system without the need for a hypervisor or separateoperating system such as Docker, etc.; or implemented as an operatingsystem level virtualization), virtual private servers, client computers,etc. The virtual machines may also be complete computationalenvironments, containing virtual equivalents of the hardware andsoftware components of a physical computing system. The term“hypervisor” may refer generally to a software layer or component thatsupports the execution of multiple virtualized computing instances,including system-level software that supports namespace containers suchas Docker, etc.

Hypervisor 114A/114B/114C maintains a mapping between underlyinghardware 112A/112B/112C and virtual resources allocated to respectivevirtual machines 131-136. Hardware 112A/112B/112C includes suitablephysical components, such as central processing unit(s) or processor(s)120A/120B/120C; memory 122A/122B/122C; physical network interfacecontrollers (NICs) 124A/124B/124C; and storage disk(s) 128A/128B/128Caccessible via storage controller(s) 126A/126B/126C, etc. Virtualresources are allocated to each virtual machine to support a guestoperating system (OS) and applications. For example, corresponding tohardware 112A/112B/112C, the virtual resources may include virtual CPU,virtual memory, virtual disk, virtual network interface controller(VNIC), etc. Hypervisor 114A/114B/114C further implements virtual switch116A/116B/116C to handle egress packets from, and ingress packets to,respective virtual machines 131-136. The term “packet” may refergenerally to a group of bits that can be transported together from asource to a destination, such as message, segment, datagram, etc.

SDN controller 160 is a “network management entity” that facilitatesnetwork virtualization in virtualized computing environment 100. Throughnetwork virtualization, logical networks may be provisioned, changed,stored, deleted and restored programmatically without having toreconfigure the underlying physical hardware. SDN controller 160 may beimplemented using physical machine(s), virtual machine(s), or both. Oneexample of an SDN controller is the NSX controller component of VMwareNSX® (available from VMware, Inc.) that operates on a central controlplane. SDN controller 160 may be a member of a controller cluster (notshown) that is configurable using an SDN manager.

Logical networks may be formed using any suitable tunneling protocol,such as Virtual eXtension Local Area Network (VXLAN), StatelessTransport Tunneling (STT), Generic Network Virtualization Encapsulation(GENEVE), etc. For example, VXLAN is a layer-2 overlay scheme on alayer-3 network that uses tunnel encapsulation to extend layer-2segments across multiple hosts. To facilitate communication amongmembers of a logical network, hypervisor 114A/114B/114C implements avirtual tunnel endpoint (VTEP) to encapsulate and decapsulate packetswith a tunnel header identifying the logical network. For example inFIG. 1, VM1 131 on host-A 110A, as well as VM5 135 and VM6 136 on host-C110C, are configured as members of a VXLAN logical network (e.g.,VXLAN501). To facilitate data-plane communication between source VM1 131to destination VM5 135, hypervisor-A 114A encapsulates each data packetwith a tunnel header that identifies VXLAN network identifier (VNI)=501,a source VTEP implemented by hypervisor-A 114A and a destination VTEPimplemented by hypervisor-C 114C. At the destination, the tunnel headeris then removed by hypervisor-C 114C before the data packets aredelivered to VM5 135.

SDN controller 160 is responsible for collecting and disseminatingcontrol information relating to logical networks and overlay transporttunnels, etc. To send and receive the control information, local controlplane (LCP) agent 118A/118B/118C on host 110A/110B/110C requirescontrol-plane connectivity 150/152/154 with central control plane (CCP)module 162 at SDN controller 160. Here, the term “control-planeconnectivity” may refer generally the ability of SDN controller 160 andhost 110A/110B/110C to communicate with each other, such as over amanagement network. To provide the control-plane connectivity, a controlchannel may be established between SDN controller 160 and host110A/110B/110C using any suitable protocol, such as using TransmissionControl Protocol (TCP) over Secure Sockets Layer (SSL), etc.

In practice, however, host 110A/110B/110C may lose control-planeconnectivity 150/152/154 with SDN controller 160. For example, in amulti-site data center, host-C 110C located at one site might losecontrol-plane connectivity (see 156 in FIG. 1) with SDN controller 160located in at different site. Due to such disruption, host-C 110C willoperate in a “headless mode” without the ability to send and receive thelatest control information. When updated control information such asrules and policies are disseminated by SDN controller 160 to other hoststhat still have control-plane connectivity, host-C 110C will become outof synchronization, resulting in performance degradation of host-C 110Cas well as associated logical network(s).

Handling Control-Plane Connectivity Loss

According to examples of the present disclosure, resilience androbustness against the loss of control-plane connectivity with SDNcontroller 160 may be improved. Instead of waiting for the control-planeconnectivity to be restored, a host (e.g., host-C 110C) operating in aheadless mode may obtain control information via peer-to-peer (P2P)network 140 connecting multiple hosts. This way, the host may continueto perform various functionalities based on the obtained controlinformation, thereby reducing the likelihood of performance degradationdue to out-of-synchronization.

In more detail, FIG. 2 is a flowchart of example process 200 for a firsthost to handle control-plane connectivity loss in virtualized computingenvironment 100. Example process 200 may include one or more operations,functions, or actions illustrated by one or more blocks, such as 210 to240. The various blocks may be combined into fewer blocks, divided intoadditional blocks, and/or eliminated depending on the desiredimplementation. In practice, example process 200 may be implemented byhost 110A/110B/110C using LCP agent 118A/118B/118C supported byhypervisor 114A/114B/114C. In the following, an example will beexplained using host-C 110C as an example “first host”; host-A 110A andhost-B 110B as example “second hosts”; and SDN controller 160 as anexample “network management entity.”

At 210 in FIG. 2, host-C 110C detects a loss of control-planeconnectivity between host-C 110C and SDN controller 160 (see 156 in FIG.1). At 220 in FIG. 2, host-C 110C generates a request message forcontrol information that host-C 110C is unable to obtain from SDNcontroller 160. For example, the control information may be related tological networks and overlay transport tunnels in virtualized computingenvironment 100, such as logical network topology, logical networkmembership information, hardware-to-VTEP address mapping information,protocol-to-hardware address mapping information, distributed firewallrules and policies applicable to a logical network, etc.

At 230 in FIG. 2, host-C 110C sends the request message (see 170 inFIG. 1) via P2P network 140 that connects host-C 110C with host-A 110Aand host-B 110B. In the example in FIG. 1, host-A 110A is able tosatisfy the request message (see 172 in FIG. 1) and replies with aresponse message with the control information (see 180 in FIG. 1). At240 in FIG. 2, host-C 110C updates control information based on aresponse message from host-A 110A (see 182 in FIG. 1).

As used herein, the term “peer-to-peer network” may refer generally to adistributed network architecture via which multiple hosts may interactwith each other (e.g., to send and/or receive control information)without the need for central coordination by a central authority such asSDN controller 160. Each host on P2P network 140 may act as a “client”to request for control information from other hosts, or as a “server” tosend control information to other hosts. As will be described furtherusing FIG. 3 to FIG. 8, one example of a P2P network is a chord networkhaving a ring topology. Depending on the desired implementation inpractice, any alternative P2P architecture may be used, such as pastry,content addressable network (CAN) and tapestry (all three areimplementations of a distributed hash table similar to chord), etc.

Using example process 200, host-C 110C in FIG. 1 is provided with afault tolerance mechanism to use P2P network 140 for control informationupdates when there is a loss of control-plane connectivity with SDNcontroller 160. In practice, P2P network 140 may also be used forpushing control information to other hosts. For example, as will beexplained using FIG. 8, in response to detecting an event that causes anupdate to the control information, host-C 110C may generate and send aproactive report message to other hosts (e.g., host-A 110A and host-B110B). This facilitates control information synchronization among hostsusing P2P network 140.

In the following, various examples will be explained using FIG. 3 toFIG. 8. Examples for joining P2P network 140 will be explained usingFIG. 3 and FIG. 4, example request and response messages using FIG. 5,FIG. 6 and FIG. 7, and example proactive report messages using FIG. 8.

Joining P2P Network

FIG. 3 is a flowchart of example detailed process 300 for joining P2Pnetwork 140. Example process 300 may include one or more operations,functions, or actions illustrated by one or more blocks, such as 305 to375. The various blocks may be combined into fewer blocks, divided intoadditional blocks, and/or eliminated depending on the desiredimplementation. FIG. 3 will be explained using FIG. 4, which is aschematic diagram 400 illustrating a first host joining P2P network 140.

In the following, host-C 110C will be used as an example “first host”;host-A 110A, host-B 110B, host-D 110D, and host-E 110E as example“second hosts”; and SDN controller 160 as an example “network managemententity.” Example process 300 may be implemented by host110A/110B/110C/110D/110E, such as using LCP agent118A/118B/118C/118D/118E supported by hypervisor114A/114B/114C/114D/114E, and implemented by SDN controller 160 usingCCP module 162, etc. For simplicity, virtual machines and hardwarecomponents associated with host-D 110D and host-E 110E are not shown inFIG. 4.

Consider the scenario where host-A 110A, host-B 110B, host-D 110D andhost-E 110E are existing members of P2P network 140. According to 310and 315 in FIG. 3, in response to determination that host-C 110C isjoining P2P network 140, SDN controller 160 assigns a unique identifier(ID) to host-C 110C. For example, host-C 110C may be assigned withID=UUID-C, which represents a universally unique identifier (UUID) thatensures unambiguous identification of host-C 110C.

In the example in FIG. 4, P2P network 140 is implemented using a chordnetwork, which is a relatively robust and self-organizing structured P2Parchitecture. Using a consistent hashing algorithm, hosts 110A-110E mayarrange themselves on a ring network topology based on their respectiveUUlDs. For example, based on key=hash(UUID) that is mappable to acircular key space, each host may select its successor and predecessoron P2P network 140.

According to 320 in FIG. 3, SDN controller 160 sends UUID-C associatedwith host-C 110C to the existing members. As shown in FIG. 4, UUID-C issent to host-A 110A (see 410 in FIG. 4), host-B 110B (see 420 in FIG.4), host-D 110D (see 430 in FIG. 4) and host-E 110E (see 440 in FIG. 4).Further, according to 325 in FIG. 3, SDN controller 160 sends (UUID-A,UUID-B, UUID-C, UUID-D, UUID-E) to host-C 110C (see 450 in FIG. 4).

According to 330 and 335 in FIG. 3, in response to receiving (UUID-A,UUID-B, UUID-C, UUID-D, UUID-E), host-C 110C compares the UUlDs todetermine successor=hypervisor-D 110D and predecessor=host-B 110B (see455 in FIG. 4). For example, this may involve calculating and comparinghash(UUID-A), hash(UUID-B), hash(UUID-C), hash(UUID-D) and hash(UUID-E).According to 340 and 345 in FIG. 3, host-C 110C then merges into P2Pnetwork 140 by establishing a first connection with successor=host-D110D (see 460 in FIG. 4) and a second connection with predecessor=host-B110B (see 470 in FIG. 4).

According to 350, 355 and 360 in FIG. 3, in response to receiving UUID-Cfrom SDN controller 160, host-D 110D determines that its predecessor haschanged from host-B 110B to new member host-C 110C (see 435 in FIG. 4)and proceeds to terminate its connection with host-B 110B (see 480 inFIG. 4).

According to 350, 365 and 370 in FIG. 3, in response to receivingUUID-C, host-B 110B determines that its successor has changed to newmember host-C 110C (see 425 in FIG. 4) and terminates its connectionwith host-D 110D (if not already terminated; see 480 in FIG. 4).

According to 350 and 375 in FIG. 3, host-A 110A and host-E 110E areunaffected. For example, host-A 110A remains associated withsuccessor=host-B 110B and predecessor=host-E 110E (see 415 in FIG. 4).Host-E 110E is associated with successor=host-A 110A andpredecessor=host-D 110D (see 445 in FIG. 4).

In practice, a connection between a pair of hosts (more specifically,hypervisors) may be established using any suitable protocol, such astransmission control protocol (TCP), user datagram protocol (UDP), etc.In another example, a pair of hypervisors may use any suitable tunnelingprotocol to communicate with each other, such as VXLAN, STT, GENEVE,etc. When a host leaves P2P network 140, SDN controller 160 will notifythe remaining hosts to recalculate their predecessor and successor, andupdate connection(s) where applicable.

Obtaining Control Information Via P2P Network

FIG. 5 is a flowchart of example detailed process 500 for handlingcontrol-plane connectivity loss in virtualized computing environment100. Example process 500 may include one or more operations, functions,or actions illustrated by one or more blocks, such as 501 to 519. Thevarious blocks may be combined into fewer blocks, divided intoadditional blocks, and/or eliminated depending on the desiredimplementation. Host 110A/110B/110C/110D/110E may implement thefollowing examples using LCP agent 118A/118B/118C/118D/118E supported byhypervisor 114A/114B/114C/114D/114E.

(a) Lookup-Based Approach

In a first example, a lookup-based approach will be explained using FIG.5 and FIG. 6, which is a schematic diagram illustrating examplelookup-based approach 600 for handling control-plane connectivity lossaccording to the example in FIG. 5.

According to 501 and 502 in FIG. 5, in response to detecting a loss ofcontrol-plane connectivity with SDN controller 160, host-C 110C entersinto a headless mode. In one example, this may involve detecting adisconnection of a control channel (e.g., TCP connection) between LCPagent 118C and SDN controller 160. In another example, the loss ofcontrol-plane connectivity may also be due to a failure (e.g., power,hardware, software, etc.) at a physical switch or router connectinghost-C 110C with SDN controller 160. Host-C 110C may reattempt toreconnect with SDN controller 160 for a predetermined number of retriesor predetermined amount of time before deciding that control-planeconnectivity is lost.

According to 503 and 504 in FIG. 5, host-C 110C generates a requestmessage to request for control information, and sends the requestmessage via P2P network 140. In practice, control information may bemaintained by LCP agent 118C in the format of <ID, message, revision>format, where ID is an indexing key, message is a serialized messagethat includes all properties associated with message ID, and revisionrepresents the latest version number. Control information relating totraffic forwarding may be maintained in a forwarding information base(FIB), etc.

In the example in FIG. 6, host-C 110C has entered into a headless modeafter detecting a loss of control-plane connectivity with SDN controller160 (see 156 in FIG. 6). Referring to 601 in FIG. 6, host-C 110Ccurrently has a particular version of control information <VNI=501,message, revision=2> and wishes to obtain a newer version of the controlinformation (i.e., revision >2). At 610 in FIG. 6, since host-C 110C isable to obtain the newer version from SDN controller 160 during theheadless mode, host-C 110C generates and sends a request message thatidentifies VNI=501 and revision=2 to its predecessor=host-B 110B via P2Pnetwork 140.

The request message triggers other hosts on P2P network 140 to eithersend a response message (if the request message can be satisfied), orforward the request message via P2P network 140 according to blocks 510to 519 in FIG. 5. At host-B 110B, in response to receiving the requestmessage via P2P network 140, host-B 110B determines that it cannotsatisfy the request message (i.e., it does not have the requestedVNI=501, revision >2) according to 510, 511 and 512 in FIG. 5. Instead,as shown at 602 in FIG. 6, host-B 110B has control information <VNI=503,message, revision=2>. As such, according to 513 in FIG. 5, host-B 110Bis triggered to forward the request message via P2P network to itspredecessor=host-A 110A.

At host-A 110A, in response to receiving the request message via P2Pnetwork 140, host-A 110A determines that it is able to satisfy therequest message according to 510, 511 and 512 in FIG. 5. In particular,as shown at 603 in FIG. 6, host-A 110A has control information <VNI=501,message, revision=3>. As such, the request message triggers host-A 110Ato generate and send a response message with the control information viaP2P network 140 according to 514 and 515 in FIG. 5. In the example inFIG. 6, host-A 110A echoes or floods the response message within P2Pnetwork 140 by sending the response message to both its successor=host-B110B (see 630 in FIG. 6) and predecessor=host-E 110E (see 640 in FIG.6).

Next, host-B 110B receives and examines the response message from host-A110A according to 510, 511 and 516 in FIG. 5. In response todetermination that the response message is not relevant (e.g., notinterested in VNI=501), host-B 110B is triggered to forward the responsemessage via P2P network 140 according to 517 and 519 in FIG. 5. In theexample in FIG. 6, the response message is forwarded to successor=host-C110C, which is the intended the recipient of the response message (see650 in FIG. 6).

Host-E 110E also receives the response message from host-A 110Aaccording to 510, 511 and 516 in FIG. 5. In this case, however, host-E110E determines that the response message is relevant, and is triggeredto synchronize or update its control information according to 517 and518 in FIG. 5. In the example in FIG. 6, host-E 110E updates its controlinformation from <VNI=501, message, revision=2> (see 604 in FIG. 6) to<VNI=501, message, revision=3> (see 605 in FIG. 6). Since host-E 110E isnot the intended recipient, the response message is then forwarded viaP2P network 140, this time from host-E 110E to host-D 110D (see 660 inFIG. 6).

Host-D 110D receives the response message from host-E 110E according to510, 511 and 516 in FIG. 5. In response to determination that theresponse message is not relevant (e.g., not interested in VNI=501; seealso 606 in FIG. 6), host-D 110D is triggered to forward the responsemessage via P2P network 140 according to 517 and 519 in FIG. 5. In theexample in FIG. 6, the response message is forwarded by host-D 110D topredecessor=host-C 110C, which is the intended the recipient of theresponse message (see 670 in FIG. 6).

Host-C 110C receives two copies of the response message sent by host-A110A, i.e., one from host-B 110B (see 650 in FIG. 6) and another fromhost-D 110D (see 670 in FIG. 6). In response to receiving the responsemessage, host-C 110C updates its control information from <VNI=501,message, revision=2> (see 601 in FIG. 6) to <VNI=501, message,revision=3> (see 607 in FIG. 6) according to 505 and 506 in FIG. 5.Using the examples in FIG. 5 and FIG. 6, host-C 110C is able to updateits control information even when it has lost control-plane connectivitywith SDN controller 160.

(b) Flooding-Based Approach

In a second example, a flooding-based approach will be explained usingFIG. 5 and FIG. 7, which is a schematic diagram illustrating exampleflooding-based approach 700 for handling control-plane connectivity lossaccording to the example in FIG. 5.

Similar to the example in FIG. 6, host-C 110C enters into a headlessmode in response to detecting a loss of control-plane connectivity withSDN controller 160 according to 501 and 502 in FIG. 5. Host-C 110Chost-C 110C currently has a particular version of control information<VNI=501, message, revision=2> (see 701 in FIG. 7) and wishes to obtaina newer version of the control information. According to 503 and 504 inFIG. 5, a request message is generated and sent via P2P network 140.

In contrast to the lookup-based approach in FIG. 6, host-C 110C maymulticast the request message by sending it in both directions. In theexample in FIG. 7, host-C 110C sends a first request message topredecessor=host-B 110B (see 710 in FIG. 7) and a second request messageto successor=host-D 110D (see 720 in FIG. 7), which has the effect offlooding P2P network 140 from both directions. The request message maybe forwarded until it reaches a (healthy) host that is able to satisfythe request message.

At host-B 110B, in response to receiving the first request message fromhost-C 110C via P2P network 140, host-B 110B determines that it does nothave the requested control information (i.e., VNI=501, revision >2)according to 510, 511 and 512 in FIG. 5. Instead, as shown at 702 inFIG. 7, host-B 110B has control information <VNI=503, message,revision=2>. As such, according to 513 in FIG. 5, host-B 110B istriggered to forward the request message via P2P network 140 to itspredecessor=host-A 110A (see 730 in FIG. 7).

At host-D 110D, in response to receiving the second request message fromhost-C 110C via P2P network 140, host-D 110D determines that it does nothave the requested control information (i.e., VNI=501, revision >2)according to 510, 511 and 512 in FIG. 5. Instead, as shown at 703 inFIG. 7, host-D 110D has control information <VNI=502, message,revision=2>. According to 513 in FIG. 5, host-D 110D is triggered toforward the request message to its predecessor=host-E 110E (see 740 inFIG. 7).

At host-E 110E, in response to receiving the request message from host-D110D via P2P network 140, host-E 110E determines that it does not havethe requested control information according to 510, 511 and 512 in FIG.5. Instead, as shown at 704 in FIG. 7, its control information is thesame version as that of host-C 110C, i.e., <VNI=501, message,revision=2>. According to 513 in FIG. 5, host-E 110E is triggered toforward the request message to predecessor=host-A 110A (see 750 in FIG.7).

Host-A 110A receives two copies of the request message sent by host-C110C, i.e., one via host-B 110B (see 730 in FIG. 7) and another viahost-E 110E (see 750 in FIG. 7). In response to receiving the requestmessages, host-A 110A determines that it has the requested controlinformation according to 510, 511 and 512 in FIG. 5. In particular,host-A 110A has the requested <VNI=501, message, revision=3> (see 705 inFIG. 7).

Since host-A 110A is able to satisfy the request message, a responsemessage with the requested control information is generated and sentaccording to 514 and 515 in FIG. 5. In contrast to the lookup-basedapproach in FIG. 6, however, host-A 110A sends the response message tohost-C 110C via a direct connection between them (see 760 in FIG. 7).For example, this may involve host-A 110A establishing a transientconnection (e.g., using TCP, UDP, etc.) with host-C 110C prior tosending the response message.

Host-C 110C receives the response message sent by host-A 110A via theconnection between them. In response to receiving the response message,host-C 110C updates its control information from <VNI=501, message,revision=2> (see 701 in FIG. 7) to newer version <VNI=501, message,revision=3> (see 706 in FIG. 7) according to 505 and 506 in FIG. 5.

Using the examples in FIG. 5 and FIG. 7, host-C 110C can continue toobtain updated control information even when it has lost control-planeconnectivity with SDN controller 160. In general, a lookup operationwithin a chord network contacts O(log N) nodes to complete a query in anN-node network. Depending on the desired implementation, theflooding-based approach in FIG. 7 may achieve better latency than thelookup-based approach in FIG. 6 in some cases. In particular, sincehost-A 110A utilizes a direct connection, host-C 110C may receive theupdated control information faster, especially when the response messagehas to travel through many hops in a P2P network with a large number ofhosts. However, the latency and overheads associated with establishingthe connection should be taken into account when choosing one approachover another.

Also, according to the flooding-based approach, other hosts (e.g.,host-B 110B and host-D 110D) that are not interested in the requestedcontrol information do not have to process the response message.However, this also means that host-E 110E will not be able to snoop onthe response message from host-A 110A to updates it control information<VNI=501, message, revision=2> (see 704 in FIG. 7). Assuming that host-E110E has control-plane connectivity with SDN controller 160, the controlinformation should be updated to revision=3 in due course.

Otherwise, if the control-plane connectivity is lost, host-E 110E mayenter into the headless mode and send a request message in a similarmanner as explained above. In this case, host-C 110C may also functionas both a “first host” (since it is also headless) according to blocks501 to 509 in FIG. 5, and a “second host” (since it may be triggered toforward a request message from host-E 110E or send a response messagewith the requested control information) according to blocks 510-519 inFIG. 5. This way, P2P network 140 may be utilized by multiple hostsoperating in the headless mode to update their control information.

It should be understood that various modifications may also be made tothe examples discussed. For example in FIG. 6, instead of sending therequest message to predecessor=host-B 110B, host-C 110C may selectsuccessor=host-D 110D as its first lookup destination instead. In thiscase, the request message will travel in a clockwise direction to reachhost-A 110A, which generates and sends the response message. Host-A 110Amay then send the respond message in both directions via itspredecessor=host-E 110E, successor=host-B 110B, or both, to reach host-C110C. Alternatively, similar to the example in FIG. 7, the responsemessage may be sent via a direct connection between host-A 110A andhost-C 110C.

Further, host-C 110C may send a single request message to request formultiple sets of control information for simultaneous synchronization ofmultiple states, e.g., associated with VNI=501, VNI=504, etc. Differenttypes of control information may be requested, such asprotocol-to-hardware address mapping information, firewall rules, etc. Aresponse message may also include multiple sets of control information.In some cases, the control information may be obtained from multipleresponse messages. For example, host-A 110A may send a first responsemessage associated with VNI=501, while another host (say host-E 110E)sends a second response message associated with VNI=504.

Proactive Report Message

According to examples of the present disclosure, P2P network 140 may beused to push control information in a proactive manner. An example willbe explained using FIG. 5 (see blocks 507, 508 and 509) and FIG. 8,which is a schematic diagram illustrating example 800 of a first hostpushing control information to second hosts via P2P network 140.

Referring first to FIG. 5, at 507, host-C 110C detects an event thatcauses an update to its control information. In the example in FIG. 8,control information associated with VXLAN501 is updated from <VNI=501,message, revision=3> (see 801 in FIG. 8) to <VNI=501, message,revision=4> (see 802 in FIG. 8). For example, the detected eventassociated with VXLAN501 may be the powering ON/OFF of a virtual machinelocated on VXLAN501 (e.g., VM7, not shown for simplicity), migration ofa virtual machine (e.g., VM7) located on VXLAN501, changes to IP-to-MACaddress mapping information, etc.

Since host-C 110C has lost control-plane connectivity with SDNcontroller 160, host-C 110C is not able to push the updated controlinformation to SDN controller 160 for dissemination to other hosts. Assuch, according to 508 and 509 in FIG. 5, host-C 110C generates andsends a proactive report message to report the update via P2P network140. In the example in FIG. 8, the proactive report message is sent byhost-C 110C to both its predecessor=host-B 110B (see 810 in FIG. 8) andsuccessor=host-D 110D (see 820 in FIG. 8).

Each host on P2P network 140 may process the proactive report messageaccording to blocks 510-511 and 516-519 in FIG. 5. Host-B 110B receivesthe proactive report message from host-C 110C according to 510, 511 and516 in FIG. 5. In response to determination that the proactive reportmessage is not relevant (e.g., not interested in VNI=501; see 803 inFIG. 8), the proactive report message is forwarded via P2P network 140according to 517 and 519 in FIG. 5. In the example in FIG. 8, theproactive report message is forwarded to predecessor=host-A 110A (see830 in FIG. 8).

Similarly, host-D 110D also receives the proactive report message fromhost-C 110C according to 510, 511 and 516 in FIG. 5. In response todetermination that the proactive report message is not relevant (e.g.,not interested in VNI=501; see also 804 in FIG. 8), host-D 110D forwardsthe proactive report message via P2P network 140 according to 517 and519 in FIG. 5. In the example in FIG. 8, the proactive report message isforwarded to successor=host-E 110E (see 840 in FIG. 8).

At host-A 110A, the proactive report message is received and determinedto be relevant according to 510, 511, 516 and 517 in FIG. 5. Theproactive report message triggers host-A 110A to update controlinformation <VNI=501, message, revision=3> (see 805 in FIG. 8) to<VNI=501, message, revision=4> (see 806 in FIG. 8) based on theproactive report message. The proactive report message is then forwardedvia P2P network 140 to predecessor=host-E 110E according to 518 in FIG.8.

At host-E 110E, the proactive report message is also received anddetermined to be relevant according to 510, 511, 516 and 517 in FIG. 5.The proactive report message triggers host-E 110E to update controlinformation <VNI=501, message, revision=3> (see 807 in FIG. 8) to<VNI=501, message, revision=4> (see 808 in FIG. 8). Since host-E 110Ereceives two copies of the proactive report message (i.e., one fromhost-A 110A and another from host-D 110D), it may stop forwarding theproactive report message within P2P network 140.

It should be understood that, in practice, multiple hosts (e.g., host-C110C and host-E 110E) may be operating in the headless modesimultaneously. According to examples of the disclosure, such headlesshosts may continue to obtain updated control information distributed bySDN controller 160 from other “non-headless” hosts (e.g., host-A 110A,host-B 110B and host-D 110D), or push updated control information tosuch non-headless hosts. Depending on the desired implementation, a setof hosts may be interested in the same control information for variousreasons, such as when they support virtual machines that are attached tothe same layer-2 logical switch, logical router, etc. In this case,control information may be synchronized among hosts in the set via P2Pnetwork 140 to reduce the burden of SDN controller 160.

In an extreme case where all hosts 110A-110E become headless (e.g., dueto a failure at SDN controller 160), they may continue to synchronizetheir control information via P2P network 140 until SDN controller 160recovers from the failure. In this case, the examples in FIG. 3 and FIG.4 may also be enhanced to enable a host to join or leave P2P network 140without any assistance from SDN controller 160, such as using pure P2Pnode identification, etc.

Computer System

The above examples can be implemented by hardware (including hardwarelogic circuitry), software or firmware or a combination thereof. Theabove examples may be implemented by any suitable computing device,computer system, etc. The computer system may include processor(s),memory unit(s) and physical NIC(s) that may communicate with each othervia a communication bus, etc. The computer system may include anon-transitory computer-readable medium having stored thereoninstructions or program code that, when executed by the processor, causethe processor to perform processes described herein with reference toFIG. 1 to FIG. 8. For example, a computer system may be deployed invirtualized computing environment 100 to perform the functionality of anetwork management entity (e.g., SDN controller 160), or host110A/110B/110C/110D/110E.

The techniques introduced above can be implemented in special-purposehardwired circuitry, in software and/or firmware in conjunction withprogrammable circuitry, or in a combination thereof. Special-purposehardwired circuitry may be in the form of, for example, one or moreapplication-specific integrated circuits (ASICs), programmable logicdevices (PLDs), field-programmable gate arrays (FPGAs), and others. Theterm ‘processor’ is to be interpreted broadly to include a processingunit, ASIC, logic unit, or programmable gate array etc.

The foregoing detailed description has set forth various embodiments ofthe devices and/or processes via the use of block diagrams, flowcharts,and/or examples. Insofar as such block diagrams, flowcharts, and/orexamples contain one or more functions and/or operations, it will beunderstood by those within the art that each function and/or operationwithin such block diagrams, flowcharts, or examples can be implemented,individually and/or collectively, by a wide range of hardware, software,firmware, or any combination thereof.

Those skilled in the art will recognize that some aspects of theembodiments disclosed herein, in whole or in part, can be equivalentlyimplemented in integrated circuits, as one or more computer programsrunning on one or more computers (e.g., as one or more programs runningon one or more computing systems), as one or more programs running onone or more processors (e.g., as one or more programs running on one ormore microprocessors), as firmware, or as virtually any combinationthereof, and that designing the circuitry and/or writing the code forthe software and or firmware would be well within the skill of one ofskill in the art in light of this disclosure.

Software and/or to implement the techniques introduced here may bestored on a non-transitory computer-readable storage medium and may beexecuted by one or more general-purpose or special-purpose programmablemicroprocessors. A “computer-readable storage medium”, as the term isused herein, includes any mechanism that provides (i.e., stores and/ortransmits) information in a form accessible by a machine (e.g., acomputer, network device, personal digital assistant (PDA), mobiledevice, manufacturing tool, any device with a set of one or moreprocessors, etc.). A computer-readable storage medium may includerecordable/non recordable media (e.g., read-only memory (ROM), randomaccess memory (RAM), magnetic disk or optical storage media, flashmemory devices, etc.).

The drawings are only illustrations of an example, wherein the units orprocedure shown in the drawings are not necessarily essential forimplementing the present disclosure. Those skilled in the art willunderstand that the units in the device in the examples can be arrangedin the device in the examples as described, or can be alternativelylocated in one or more devices different from that in the examples. Theunits in the examples described can be combined into one module orfurther divided into a plurality of sub-units.

1. A method for a first host to handle control-plane connectivity lossin a virtualized computing environment that includes the first host,multiple second hosts and a network management entity, wherein themethod comprises: joining a peer-to-peer network by receiving, from thenetwork management entity, a first identifier associated with the firsthost and multiple second identifiers associated with respective multiplesecond hosts; detecting a loss of control-plane connectivity between thefirst host and the network management entity; generating a requestmessage for control information that the first host is unable to obtainfrom the network management entity; sending the request message via thepeer-to-peer network that connects the first host with the multiplesecond hosts; and obtaining the control information from a responsemessage that is sent by at least one of the multiple second hosts. 2.The method of claim 1, wherein the joining the peer-to-peer networkmethod further comprises: prior to detecting the loss of control-planeconnectivity, establishing a first connection with a predecessor and asecond connection with a successor, wherein the predecessor andsuccessor are selected from the multiple second hosts.
 3. The method ofclaim 2, wherein joining the peer-to-peer network further comprises:based on the first identifier and multiple second identifiers, selectingthe predecessor and the successor from the multiple second hosts.
 4. Themethod of claim 2, wherein sending the request message comprises:sending the request message to the predecessor or successor, or both,via the peer-to-peer network to trigger the predecessor or successor, orboth, to either send the response message in response to determinationthat the request message is satisfiable, or otherwise forward therequest message via the peer-to-peer network.
 5. The method of claim 2,wherein the method further comprises: receiving the response messagefrom the at least one of the multiple second hosts via the predecessoror successor on the peer-to-peer network.
 6. The method of claim 1,wherein the method further comprises: receiving the response message viaa direct connection between the first host and the at least one of themultiple second hosts.
 7. The method of claim 1, wherein the methodfurther comprises: in response to detecting an event that causes anupdate to the control information, generating a proactive report messageto report the update to the multiple second hosts; and sending theproactive report message via the peer-to-peer network.
 8. Anon-transitory computer-readable storage medium that includes a set ofinstructions which, in response to execution by a processor of a firsthost, cause the processor to perform a method of handling control-planeconnectivity loss in a virtualized computing environment that includesthe first host, multiple second hosts and a network management entity,wherein the method comprises: joining a peer-to-peer network byreceiving, from the network management entity, a first identifierassociated with the first host and multiple second identifiersassociated with respective multiple second hosts; detecting a loss ofcontrol-plane connectivity between the first host and the networkmanagement entity; generating a request message for control informationthat the first host is unable to obtain from the network managemententity; sending the request message via the peer-to-peer network thatconnects the first host with the multiple second hosts; and obtainingthe control information from a response message that is sent by at leastone of the multiple second hosts.
 9. The non-transitorycomputer-readable storage medium of claim 8, wherein the joining thepeer-to-peer network further comprises: prior to detecting the loss ofcontrol-plane connectivity, establishing a first connection with apredecessor and a second connection with a successor, wherein thepredecessor and successor are selected from the multiple second hosts.10. The non-transitory computer-readable storage medium of claim 9,wherein joining the peer-to-peer network further comprises: based on thefirst identifier and multiple second identifiers, selecting thepredecessor and the successor from the multiple second hosts.
 11. Thenon-transitory computer-readable storage medium of claim 9, whereinsending the request message comprises: sending the request message tothe predecessor or successor, or both, via the peer-to-peer network totrigger the predecessor or successor, or both, to either send theresponse message in response to determination that the request messageis satisfiable, or otherwise forward the request message via thepeer-to-peer network.
 12. The non-transitory computer-readable storagemedium of claim 9, wherein the method further comprises: receiving theresponse message from the at least one of the multiple second hosts viathe predecessor or successor on the peer-to-peer network.
 13. Thenon-transitory computer-readable storage medium of claim 8, wherein themethod further comprises: receiving the response message via a directconnection between the first host and the at least one of the multiplesecond hosts.
 14. The non-transitory computer-readable storage medium ofclaim 8, wherein the method further comprises: in response to detectingan event that causes an update to the control information, generating aproactive report message to report the update to the multiple secondhosts; and sending the proactive report message via the peer-to-peernetwork.
 15. A first host configured to handle control-planeconnectivity loss in a virtualized computing environment that includesthe first host, multiple second hosts and a network management entity,comprising: a processor; and a non-transitory computer-readable mediumhaving stored thereon instructions that, when executed by the processor,cause the processor to: join a peer-to-peer network by receiving, fromthe network management entity, a first identifier associated with thefirst host and multiple second identifiers associated with respectivemultiple second hosts; detect a loss of control-plane connectivitybetween the first host and the network management entity; generate arequest message for control information that the first host is unable toobtain from the network management entity; send the request message viathe peer-to-peer network that connects the first host with the multiplesecond hosts; and obtain the control information from a response messagethat is sent by at least one of the multiple second hosts.
 16. The firsthost of claim 15, wherein the instructions for joining the peer-to-peernetwork further cause the processor to: prior to detecting the loss ofcontrol-plane connectivity, establishing a first connection with apredecessor and a second connection with a successor, wherein thepredecessor and successor are selected from the multiple second hosts.17. The first host of claim 16, wherein the instructions for joining thepeer-to-peer network further cause the processor to: based on the firstidentifier and multiple second identifiers, select the predecessor andthe successor from the multiple second hosts.
 18. The first host ofclaim 16, wherein the instructions for sending the request message causethe processor to: send the request message to the predecessor orsuccessor, or both, via the peer-to-peer network to trigger thepredecessor or successor, or both, to either send the response messagein response to determination that the request message is satisfiable, orotherwise forward the request message via the peer-to-peer network. 19.The first host of claim 16, wherein the instructions further cause theprocessor to: receive the response message from the at least one of themultiple second hosts via the predecessor or successor on thepeer-to-peer network.
 20. The first host of claim 15, wherein theinstructions further cause the processor to: receive the responsemessage via a direct connection between the first host and the at leastone of the multiple second hosts.
 21. The first host of claim 15,wherein the instructions further cause the processor to: in response todetecting an event that causes an update to the control information,generate a proactive report message to report the update to the multiplesecond hosts; and sending the proactive report message via thepeer-to-peer network.